Counting Lattice Points and O-Minimal Structures
نویسندگان
چکیده
منابع مشابه
Counting Lattice Points in Polyhedra
We present Barvinok’s 1994 and 1999 algorithms for counting lattice points in polyhedra. 1. The 1994 algorithm In [2], Barvinok presents an algorithm that, for a fixed dimension d, calculates the number of integer points in a rational polyhedron. It is shown in [6] and [7] that the question can be reduced to counting the number of integer points in a k-dimensional simplex with integer vertices ...
متن کاملNear Integral Points of Sets Definable in O Minimal Structures
Modifying the proof of a theorem of Wilkie, it is shown that if a one dimnsional set S is definable in an O minimal expansion of the ordered field of the reals, and if it is regularly exponentially near to many integral points, then there is an unbounded set, which is R definable without parameters, and which is exponentially near to S.
متن کاملFusing o-minimal structures
In this note I construct a proper o-minimal expansion of the ordered additive group of rationals.
متن کاملLocally o-minimal structures
In this paper we study (strongly) locally o-minimal structures. We first give a characterization of the strong local o-minimality. We also investigate locally o-minimal expansions of (R,+, <).
متن کاملUniversal Counting of Lattice Points in Polytopes
Given a lattice polytope P (with underlying lattice L), the universal counting function UP (L ) = |P ∩ L| is defined on all lattices L containing L. Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation UP = UQ. Mathematics Subject Classification: 52B20, 52A27, 11P21 Partially supported by Hungarian Science Foundation Grant T 016391, and by the Fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2013
ISSN: 1687-0247,1073-7928
DOI: 10.1093/imrn/rnt102